Grid induced minor theorem for graphs of small degree
نویسندگان
چکیده
A graph H is an induced minor of a G if can be obtained from by vertex deletions and edge contractions. We show that there function f(k,d)=O(k10+2d5) so has treewidth at least f(k,d) maximum degree most d, then it contains k×k-grid as minor. This proves the conjecture Aboulker, Adler, Kim, Sintiari, Trotignon (2021) [1] any with large bounded wall or line subgraph. It also implies for fixed planar H, subexponential time algorithm weight independent set on H-induced-minor-free graphs.
منابع مشابه
Drawing High-degree Graphs with Small Grid-size Drawing High-degree Graphs with Small Grid-size
In this paper, we present a general scheme to produce interactive and static orthogonal drawings of graphs. As opposed to most known algorithms, we do not restrict ourselves to graph with maximum degree 4, but allow arbitrary degrees. We show here how, with one speciic implementation of the scheme, we can obtain an m+n 2 m+n 2-grid for all simple connected graphs without nodes of degree 1. Furt...
متن کاملDegree-constrained editing of small-degree graphs
This thesis deals with degree-constrained graph modification problems. In particular, we investigate the computational complexity of DAG Realization and Degree Anonymity. The DAG Realization problem is, given a multiset of positive integer pairs, to decide whether there is a realizing directed acyclic graph (DAG), that is, pairs are one-to-one assigned to vertices such that the indegree and the...
متن کاملMaximum degree in minor-closed classes of graphs
Given a class of graphs G closed under taking minors, we study the maximum degree ∆n of random graphs from G with n vertices. We prove several lower and upper bounds that hold with high probability. Among other results, we find classes of graphs providing orders of magnitude for ∆n not observed before, such us log n/ log log log n and log n/ log log log log n. © 2016 Elsevier Ltd. All rights re...
متن کاملTree-width of graphs without a 3×3 grid minor
We show that graphs with no minor isomorphic to the 3 × 3 grid have tree-width at most 7. A tree-decomposition of a graph G = (V, E) is an ordered pair (T,W), where T is a tree and W = (Wt : t ∈ V (T )) is a family of subsets of V (G), called bags, such that: (i) each vertex of G belongs to at least one bag; (ii) each edge of G has both ends in at least one bag; (iii) for each vertex of G, the ...
متن کاملInduced-Universal Graphs for Graphs with Bounded Maximum Degree
For a family F of graphs, a graph U is induced-universal for F if every graph in F is an induced subgraph of U . We give a construction for an induceduniversal graph for the family of graphs on n vertices with degree at most r, which has Cnb(r+1)/2c vertices and Dn2b(r+1)/2c−1 edges, where C and D are constants depending only on r. This construction is nearly optimal when r is even in that such...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2023
ISSN: ['0095-8956', '1096-0902']
DOI: https://doi.org/10.1016/j.jctb.2023.01.002